Stochastic Games with 2 Non-Absorbing States
نویسنده
چکیده
In the present paper we consider recursive games that satisfy an absorbing property defined by Vieille. We give two sufficient conditions for existence of an equilibrium payoff in such games, and prove that if the game has at most two non-absorbing states, then at least one of the conditions is satisfied. Using a reduction of Vieille, we conclude that every stochastic game which has at most two non-absorbing states admits an equilibrium payoff. † MEDS Department, Kellogg Graduate School of Management, Northwestern University, 2001 Sheridan Rd., Evanston, IL 60208, USA. e-mail: [email protected] This paper is part of the Ph.D. thesis of the author completed under the supervision of Prof. Abraham Neyman at the Hebrew University of Jerusalem. I would like to thank Prof. Neyman for many discussions and ideas and for the continuous help he offered. I also thank Nicolas Vieille for his comments on earlier versions of the paper.
منابع مشابه
Recursive Repeated Games with Absorbing States
We show the existence of stationary limiting average "-equilibria (" > 0) for two-person recursive repeated games with absorbing states. These are stochastic games where all states but one are absorbing, and in the non-absorbing state all payoos are equal to zero. A state is called absorbing, if the probability of a transition to any other state is zero for all available pairs of actions. For t...
متن کاملStochastic Parity Games on Lossy Channel Systems
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, under the constraint that both players are restricted to finitememory strategies. First, we describe a general framework, where we consider the class of 2 2 -player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contain...
متن کاملCommutative Stochastic Games
We are interested in the convergence of the value of n-stage games as n goes to infinity and the existence of the uniform value in stochastic games with a general set of states and finite sets of actions where the transition is commutative. This means that playing an action profile a1 followed by an action profile a2, leads to the same distribution on states as playing first the action profile ...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملStrategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives
We consider finite-state concurrent stochastic games, played by k ≥ 2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a tar...
متن کامل